Your browser doesn't support javascript.
Show: 20 | 50 | 100
Results 1 - 3 de 3
Filter
Add filters

Language
Document Type
Year range
1.
IEEE Transactions on Signal Processing ; : 1-16, 2022.
Article in English | Scopus | ID: covidwho-2019016

ABSTRACT

We consider the problem of sparse signal recovery in a non-adaptive pool-test setting using quantitative measurements from a non-linear model. The quantitative measurements are obtained using the reverse transcription (quantitative) polymerase chain reaction (RT-qPCR) test, which is the standard test used to detect Covid-19. Each quantitative measurement refers to the cycle threshold, a proxy for the viral load in the test sample. We propose two novel, robust recovery algorithms based on alternating direction method of multipliers and block coordinate descent to recover the individual sample cycle thresholds and hence determine the sick individuals, given the pooled sample cycle thresholds and the pooling matrix. We numerically evaluate the normalized mean squared error, false positive rate, false negative rate, and the maximum sparsity levels up to which error-free recovery is possible. We also demonstrate the advantage of using quantitative measurements (as opposed to binary outcomes) in non-adaptive pool testing methods in terms of the testing rate using publicly available data on Covid-19 testing. The simulation results show the effectiveness of the proposed algorithms. IEEE

2.
IEEE Signal Processing Magazine ; 39(3):121-129, 2022.
Article in English | ProQuest Central | ID: covidwho-1831854

ABSTRACT

Every person spends around one third of his/her life in bed. For an infant or a young toddler, this percentage can be much higher, and for bed-bound patients it can go up to 100% of their time. In-bed pose estimation is a critical step in many human behavior monitoring systems that are focused on prevention, prediction, and management of at-rest or sleep-related conditions in both adults and children. The topic of automatic noncontact human pose estimation has received a lot of attention/success, especially in the last few years in the computer vision community, thanks to the introduction of deep learning and its power in artificial intelligence (AI) modeling. However, the state-of-the-art (SOTA) vision-based AI algorithms in this field can hardly work under the challenges associated with in-bed human behavior monitoring, such as significant illumination changes (e.g., full darkness at night), heavy occlusion (e.g., covering by a sheet or blanket), as well as the privacy concerns that mitigate large-scale data collection, necessary for any deep learning-based model training. The data quality challenges and privacy concerns have hindered the use of advanced vision-based in-bed behavior monitoring systems at home, which during the recent COVID-19 pandemic could have been an effective way to control the spread of the virus by avoiding in-person visits to clinics.

3.
IEEE Transactions on Signal and Information Processing over Networks ; 2022.
Article in English | Scopus | ID: covidwho-1752451

ABSTRACT

Graph Signal Processing (GSP) is an emerging research field that extends the concepts of digital signal processing to graphs. GSP has numerous applications in different areas such as sensor networks, machine learning, and image processing. The sampling and reconstruction of static graph signals have played a central role in GSP. However, many real-world graph signals are inherently time-varying and the smoothness of the temporal differences of such graph signals may be used as a prior assumption. In the current work, we assume that the temporal differences of graph signals are smooth, and we introduce a novel algorithm based on the extension of a Sobolev smoothness function for the reconstruction of time-varying graph signals from discrete samples. We explore some theoretical aspects of the convergence rate of our Time-varying Graph signal Reconstruction via Sobolev Smoothness (GraphTRSS) algorithm by studying the condition number of the Hessian associated with our optimization problem. Our algorithm has the advantage of converging faster than other methods that are based on Laplacian operators without requiring expensive eigenvalue decomposition or matrix inversions. The proposed GraphTRSS is evaluated on several datasets including two COVID-19 datasets and it has outperformed many existing state-of-the-art methods for time-varying graph signal reconstruction. GraphTRSS has also shown excellent performance on two environmental datasets for the recovery of particulate matter and sea surface temperature signals. IEEE

SELECTION OF CITATIONS
SEARCH DETAIL